Pattern Recognition on Oriented Matroids: the Existence of a Tope Committee
نویسنده
چکیده
Oriented matroids can serve as a tool of modeling of collective decision-making processes in contradictory problems of pattern recognition. We present a generalization of the committee techniques of pattern recognition to oriented matroids. A tope committee for an oriented matroid is a subset of its maximal covectors such that every positive halfspace contains more than half of the covectors from this subset. For a large subfamily of oriented matroids their committee structure is quite rich; for example, any maximal chains in their tope posets provide one with information sufficient to construct a committee.
منابع مشابه
Pattern Recognition on Oriented Matroids: Three–tope Committees
A three-tope committee K∗ for a simple oriented matroidM is a 3-subset of its maximal covectors such that every positive halfspace of M contains at least two topes from K∗. We consider three-tope committees as the vertex sets of triangles in graphs associated with the topes and enumerate them making use of the properties of the poset of convex subsets of the ground set of M.
متن کاملPattern Recognition on Oriented Matroids: Layers of Tope Committees
A tope committee K for a simple oriented matroid M is a subset of its maximal covectors such that every positive halfspace of M contains more than a half of the maximal covectors from K. The structures of the family of all committees for M, and of the family of its committees that contain no pairs of opposites, are described. Farey subsequences associated to the elements of the mth layer of the...
متن کاملOn tope graphs of complexes of oriented matroids
We give two graph theoretical characterizations of tope graphs of (complexes of) oriented matroids. The first is in terms of excluded partial cube minors, the second is that all antipodal subgraphs are gated. A direct consequence is a third characterization in terms of zone graphs of tope graphs. Further corollaries include a characterization of topes of oriented matroids due to da Silva, anoth...
متن کاملGeneration of Oriented Matroids - A Graph Theoretical Approach
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretical representations of oriented matroids, and all these methods work in general rank and for nonuniform and uniform oriented matroids as well. We consider two types of graphs, cocircuit graphs and tope graphs, and discus...
متن کامل10 Points in Dimension 4 not Projectively Equivalent to the Vertices of a Convex Polytope
Here admissible means that none of the n points is sent to infinity by the projective transformation. For dimension two and three the numbers f (d) are known: f (2) = 5 and f (3) = 7. For d ≥ 2, Larman has established in [6] the bounds 2d + 1 ≤ f (d) ≤ (d + 1)2, and conjectured that f (d) = 2d + 1. The upper bound has been improved to f (d) ≤ (d + 1)(d + 2)/2 by Las Vergnas [7], as a corollary ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009